Distributed Computing with Hierarchical Master-worker Paradigm for Parallel Branch and Bound Algorithm
نویسندگان
چکیده
This paper discusses the impact of the hierarchical master-worker paradigm on performance of an application program, which solves an optimization problem by a parallel branch and bound algorithm on a distributed computing system. The application program, which this paper addresses, solves the BMI Eigenvalue Problem, which is an optimization problem to minimize the greatest eigenvalue of a bilinear matrix function. This paper proposes a parallel branch and bound algorithm to solve the BMI Eigenvalue Problem with the hierarchical master-worker paradigm. The experimental results showed that the conventional algorithm with the master-worker paradigm significantly degraded performance on a Grid test bed, where computing resources were distributed on WAN via a firewall; however, the hierarchical master-worker paradigm sustained good performance.
منابع مشابه
A Parallel Branch and Bound Algorithm for Solving Large Scale Integer Programming Problems
Branch and Bound technique is commonly used for intelligent search in finding a set of integer solutions within a space of interest. The corresponding binary tree structure provides a natural parallelism allowing concurrent evaluation of subproblems using parallel computing technology. While the master-worker paradigm is successfully used in many parallel applications as a common framework to i...
متن کاملMW: A Software Framework for Combinatorial Optimization on Computational Grids
Branch and bound is the backbone of many algorithms for solving combinatorial optimization problems, dating at least as far back as the work of Little, Murty, Sweeney, and Karel in solving the traveling salesman problem [18]. Branch and bound and similar tree-search techniques have been implemented on a variety of parallel computing platforms dating back to the advent of multiprocessor machines...
متن کامل"Must-Work": A Scalable Model for Parallel Recursive Problems on P2P Networks
Most of real world problems are cpu-time intensive; their solutions take too much time to compute using a single machine. The grid and cloud computing offer a potential solution to this problem. However, such solutions are in general expensive. An alternative solution uses P2P networks, a set of machines in the Internet which collaborate to perform the same task. Branch-and-Bound is a model of ...
متن کاملScalable And Fault Tolerant Hierarchical B&B Algorithms For Computational Grids
Solving to optimality large instances of combinatorial optimization problems using Branch and Bound (B&B) algorithms requires a huge amount of computing resources. Nowadays, such power is provided by large scale environments such as computational grids. However, grids induce new challenges: scalability, heterogeneity, and fault tolerance. Most of existing gridbased B&Bs are developed using the ...
متن کاملLoad Balancing for Parallel Branch and Bound
A strategy for parallelization of a state-of-the-art Branch and Bound algorithm for weighted CSPs and other graphical model optimization tasks is introduced: independent worker nodes concurrently solve subproblems, managed by a Branch and Bound master node; the problem cost functions are used to predict subproblem complexity, enabling efficient load balancing, which is crucial for the performan...
متن کامل